Concurrent Composition in the Bounded Quantum Storage Model
نویسنده
چکیده
We define the BQS-UCmodel, a variant of the UCmodel, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in the BQS-UC model that composes concurrently with other protocols and an (a-priori) polynomially-bounded number of instances of itself. Our protocol has an efficient simulator which is important if one wishes to compose our protocol with protocols that are only computationally secure. Combining our result with prior results, we get a statistically BQS-UC secure constant-round protocol for general two-party computation without the need for any setup assumption.
منابع مشابه
Composable Security in the Bounded-Quantum-Storage Model
We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the boundedquantum-storage model, and show that this definition allows for sequential composition of protocols. Damg̊ard et al. (FOCS ’05, CRYPTO ’07) showed how to securely implement bit commitment and oblivious transfer in the...
متن کاملWeighted composition operators between Lipschitz algebras of complex-valued bounded functions
In this paper, we study weighted composition operators between Lipschitz algebras of complex-valued bounded functions on metric spaces, not necessarily compact. We give necessary and sufficient conditions for the injectivity and the surjectivity of these operators. We also obtain sufficient and necessary conditions for a weighted composition operator between these spaces to be compact.
متن کاملProtocols for Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions
Until recently, most research on the topic of secure computation focused on the stand-alonemodel, where a single protocol execution takes place. In this paper, we construct protocolsfor the setting of bounded-concurrent self composition, where a (single) secure protocol is runmany times concurrently, and there is a predetermined bound on the number of concurrentexecutions. In sh...
متن کاملComposing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum-information-theoretic conditions which must be satisfied by the protocol to be secure. The conditions are uniquely determined by the ideal functionality F defining the cryptographic task to be implemented. We t...
متن کاملAchieving the physical limits of the bounded-storage model
Secure two-party cryptography is possible if the adversary’s quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol. This special case is known as the bounded-storage model, and it has long been an open question whether security can still be achieved if the adversary’s s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010